Turing-Complete Subclasses of CHR
نویسنده
چکیده
Interesting subclasses of CHR are still Turing-complete: CHR with only one kind of rule, with only one rule, and propositional refined CHR. This is shown by programming a simulator of Turing machines (or Minsky machines) within those subclasses. Single-headed CHR without host language and propositional abstract CHR are not Turing-complete.
منابع مشابه
Expressiveness of Multiple Heads in CHR
Constraint Handling Rules (CHR) is a general purpose, committedchoice declarative language which, differently from other similar languages, uses multi-headed (guarded) rules. In this paper we prove that multiple heads augment the expressive power of the language. In fact, we first show that restricting to single head rules affects the Turing completeness of CHR, provided that the underlying sig...
متن کاملA On the expressive power of multiple heads in CHR
Constraint Handling Rules (CHR) is a committed-choice declarative language which has been originally designed for writing constraint solvers and which is nowadays a general purpose language. CHR programs consist of multi-headed guarded rules which allow to rewrite constraints into simpler ones until a solved form is reached. Many empirical evidences suggest that multiple heads augment the expre...
متن کاملBandwidth Constraints on Problems Complete for Polynomial Time
A graph G = ( b’. El has bandwidth k under a layout L : V 4’ ’ { 1. . . . , 1 VJ} if, for all {s. y} E E. jL(x 1 -L(y)] s k. Bandwidth constraints on several problems that are complete for [Fp (under log space reductions) are considered. In particular, the solvable path system problem and the and/or graph accessibility problem under various bandwidth constraints are used to prove results about ...
متن کاملConstraint handling rules. Compositional semantics and program transformation
This thesis intends to investigate two aspects of Constraint Handling Rules (CHR). It proposes a compositional semantics and a technique for program transformation. CHR is a concurrent committed-choice constraint logic programming language consisting of guarded rules, which transform multi-sets of atomic formulas (constraints) into simpler ones until exhaustion [Frü06] and it belongs to the dec...
متن کاملDecidability properties for fragments of CHR
We study the decidability of termination for two CHR dialects which, similarly to the Datalog like languages, are defined by using a signature which does not allow function symbols (of arity > 0). Both languages allow the use of the = built-in in the body of rules, thus are built on a host language that supports unification. However each imposes one further restriction. The first CHR dialect al...
متن کامل